More efficient periodic traversal in anonymous undirected graphs
نویسندگان
چکیده
منابع مشابه
More Efficient Periodic Traversal in Anonymous Undirected Graphs
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an input simple, connected, undirected graph in a periodic manner. Graphs are assumed to be anonymous, that is, nodes are unlabeled. While visiting a node, the agent may distinguish between the edges incident to it; for each node v, the endpoints of the edge...
متن کاملOblivious periodic traversal of anonymous, undirected graphs with advice and adversarial port numbers
We consider the problem of periodic graph traversal [2], which has previously been studied in a variety of settings [2, 5, 3, 7, 13, 12, 10, 11]. The problem of periodic graph traversal is concerned with an agent having to visit every node of a graph and return to its start location and state. The periodic graph traversal problem can be extended by labeling each node to help the agent explore t...
متن کاملTraversal Graphs: Characterization and Efficient Implementation
Adaptive Programming (AP) provides programmers with a graph abstraction of their OO program’s structure (called a class graph) and encapsulates traversals and computation along traversals as adaptive methods. An adaptive method consists of a selector specification, called a strategy, that selects paths in the class graph, and a behavior definition with advice on nodes that are executed while tr...
متن کاملMore Compact Oracles for Approximate Distances in Undirected Planar Graphs
Distance oracles are data structures that provide fast (possibly approximate) answers to shortest-path and distance queries in graphs. The tradeoff between the space requirements and the query time of distance oracles is of particular interest and the main focus of this paper. Unless stated otherwise, we assume all graphs to be planar and undirected. In FOCS 2001 (J. ACM 2004), Thorup introduce...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal
We prove time-space tradeoffs for traversing undirected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs”. 1 The Complexity of Graph Traversal Graph traversal is a fundamental problem in computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.035